Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding

Extension of the Coverage Region of Multiple Access Channels by Using a Relay

From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...

A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems

In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our general rate region (i) generalizes the achievability part of Slepian-Wolf multiple-access capacity theorem to the MARC, (ii) extends the Cover-El Gamal best achi...

Robust coding for multiple-access channels

Coding for T-user multiple-access channels

Coding schemes for the binary memoryless T-user adder channel are investigated in this paper. Fit upper and lower bounds on the capacity sum, which are asymptotically tight with increasing T, are derived for the noiseless case. Second, a class of T-user mdquely demdable codes with rates, asymptotically in T, equal to the maximal achievable vahes is constructed. A decoding algorithm for these co...

Polar codes for the m-user multiple access channels

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding is o(2−N 1/2− ), where N is the block length. Although the sum capacity is achieved by this coding scheme, some points in the symmetric capacity region may not be achieved. In the case where the channel is a combinat...